The Computational Complexity of Algebraic Numbers
نویسندگان
چکیده
منابع مشابه
On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
— We consider the complexity of integer base expansions of algebraic irrational numbers from a computational point of view. We show that the Hartmanis–Stearns problem can be solved in a satisfactory way for the class of multistack machines. In this direction, our main result is that the base-b expansion of an algebraic irrational real number cannot be generated by a deterministic pushdown autom...
متن کاملComputational Classification of Numbers and Algebraic Properties
In this paper, we propose a computational classification of finite characteristic numbers (Laurent series with coefficients in a finite field), and prove that some classes have good algebraic properties. This provides tools from the theories of computation, formal languages, and formal logic for finer study of transcendence and algebraic independence questions. Using them, we place some well-kn...
متن کاملComputational Complexity on Signed Numbers
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of natural numbers is not essential. It claims that natural numbers remain usable in traditional ways without assuming the existence of at least one natural number....
متن کاملReal Algebraic Numbers: Complexity Analysis and Experimentation
We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size ≤ τ , using Sturm (-Habicht) sequences and the Bernstein subdivision solver. In particular, we unify and simplify the analysis of both methods and we give an asymptotic complexity bound of e OB(d τ). This matches the best known bounds fo...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 1975
ISSN: 0036-1429,1095-7170
DOI: 10.1137/0712008